A two-level iterative scheme for general sparse linear systems based on approximate skew-symmetrizers
نویسندگان
چکیده
We propose a two-level iterative scheme for solving general sparse linear systems. The proposed consists of preconditioner that increases the norm skew-symmetric part relative to rest and makes main diagonal coefficient matrix as close identity possible so preconditioned system is shifted possible. then solved via particular Minimal Residual Method Shifted Skew-Symmetric Systems (MRS). This leads (inner outer) where MRS has short-term recurrences satisfies an optimality condition. A inner designed skew-symmetry-preserving deflation strategy based on skew-Lanczos process. demonstrate robustness matrices from various applications.
منابع مشابه
A Two-Level Parallel Preconditioner Based on Sparse Approximate Inverses
We introduce a novel strategy for parallel preconditioning of large-scale linear systems by means of a two-level factorized sparse approximate inverse algorithm. Using graph partitioning and incomplete biconjugation we are able to obtain a highly parallel preconditioner. The algorithm has been implemented using MPI on a SGI Origin 2000 computer at Los Alamos National Laboratory and is currently...
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولA New Two-stage Iterative Method for Linear Systems and Its Application in Solving Poisson's Equation
In the current study we investigate the two-stage iterative method for solving linear systems. Our new results shows which splitting generates convergence fast in iterative methods. Finally, we solve the Poisson-Block tridiagonal matrix from Poisson's equation which arises in mechanical engineering and theoretical physics. Numerical computations are presented based on a particular linear system...
متن کاملOn the modified iterative methods for $M$-matrix linear systems
This paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. Recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the Accelerated Overrelaxation (AOR) method. In this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...
متن کاملIterative Solution of Skew-Symmetric Linear Systems
We offer a systematic study of Krylov subspace methods for solving skew-symmetric linear systems. For the method of conjugate gradients we derive a backward stable block decomposition of skew-symmetric tridiagonal matrices and set search directions that satisfy a special relationship, which we call skew-A-conjugacy. Imposing Galerkin conditions, the resulting scheme is equivalent to the CGNE al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Transactions on Numerical Analysis
سال: 2021
ISSN: ['1068-9613', '1097-4067']
DOI: https://doi.org/10.1553/etna_vol54s370